skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Braverman, M"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, 12th Innovations in Theoretical Computer Science Conference (ITCS))
    null (Ed.)
    Full Text Available 
  2. ; ; ; ; (, 12th Innovations in Theoretical Computer Science Conference (ITCS))
    null (Ed.)
    Full Text Available 
  3. ; (, 1st Symposium on Foundations of Responsible Computing (FORC 2020))
    null (Ed.)
    Full Text Available 
  4. ; ; (, Electronic colloquium on computational complexity)
    We propose a variant of the 2-to-1 Games Conjecture that we call the Rich 2-to-1 Games Conjecture and show that it is equivalent to the Unique Games Conjecture. We are motivated by two considerations. Firstly, in light of the recent proof of the 2-to-1 Games Conjecture, we hope to understand how one might make further progress towards a proof of the Unique Games Conjecture. Secondly, the new variant along with perfect completeness in addition, might imply hardness of approximation results that necessarily require perfect completeness and (hence) are not implied by the Unique Games Conjecture. 
    more » « less
    Accepted Manuscript Full Text Available
  5. ; ; ; (, Conference on Learning Theory (COLT))
    null (Ed.)
    Accepted Manuscript Full Text Available